Edge - Based Model - Theoretic Syntax
ثبت نشده
چکیده
منابع مشابه
“Model Theoretic Syntax is not Generative Enumerative Syntax with constraints”: under what condition?
The generative conception of grammars relies on the derivation process which, to its turn, depends on a hierarchical representation of syntax. We show in this paper how a fully constraint-based approach, avoiding such restriction, can constitute an alternative to generativity and form the basis of a framework for a model-theoretic conception of grammar.
متن کاملTowards an Abstract Syntax and Direct-Model Theoretic Semantics for RuleML
This paper contains a proposal of an abstract syntax and a model theoretic semantics for NafNegDatalog, sublanguage of RuleML [9]. The model-theoretic semantics use the partial logic ([7], [10]) to provide an interpretation and a satisfaction relation, and provide a formal meaning for RuleML knowledge bases written in the abstract syntax.
متن کامل26. Optimality-theoretic Syntax
This chapter lays out the basic assumptions and workings of optimality-theoretic syntax. After sketching central aspects of the model of grammar presupposed in optimality theory, I address four pieces of evidence for optimality-theoretic approaches to syntax in the first core section (viz., the ubiquity of constraint conflict, the existence of repair phenomena, the notion of default, and cross-...
متن کاملModel Theoretic Syntax and Parsing: An Application to Temporal Logic
In general, model-theoretic approaches to syntax aim to describe the syntactic structures of natural languages by means of logical formulae so that the structures are models of these formulae. However, in practice, the use of such descriptions for processing issues involves so much complexity, that they appear to be more or less useless for such tasks. We present a simple formalism, which is ba...
متن کاملHomotopy Model Theory I: Syntax and Semantics
A model theory in the framework of Univalent Foundations requires a logic that allows us to define structures on homotopy (n-)types, similar to how first-order logic can define structures on sets. We define such an “n-level” logic for finite n. The syntax is based on a generalization of Makkai’s FOLDS, obtained by an operation that allows us to add equality sorts to FOLDS-signatures. We then gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007